Character theory of infinite wreath products
نویسنده
چکیده
The representation theory of infinite wreath product groups is developed by means of the relationship between their group algebras and conjugacy classes with those of the infinite symmetric group. Further, since these groups are inductive limits of finite groups, their finite characters can be classified as limits of normalized irreducible characters of prelimit finite groups. This identification is called the “asymptotic character formula.” The K0invariant of the group C -algebra is also determined.
منابع مشابه
Algebraic structures behind Hilbert schemes and wreath products
In this paper we review various strikingly parallel algebraic structures behind Hilbert schemes of points on surfaces and certain finite groups called the wreath products. We explain connections among Hilbert schemes, wreath products, infinite-dimensional Lie algebras, and vertex algebras. As an application we further describe the cohomology ring structure of the Hilbert schemes. We organize th...
متن کاملIndistinguishability of Percolation Clusters By
We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness Ž of the infinite cluster is equivalent to nondecay of connectivity a.k.a. . long-range order . We then derive applications concerning uniqueness in Kazhdan groups and in wreath products ...
متن کاملNonrigid Group Theory of Water Clusters ( Cyclic Forms): (H2O)i for 2<=i<=6
The character table of the fully nonrigid water cluster (cyclic forms), (H_{2}O){_i}, with C{_ih} symmetry derived for the first time, for 2<=i <=6. The group of all feasible permutations is the wreath product of groups S{_i}[S{_2}] which consists of i!2i operations for i = 2, ..., 6 divided into ( w.r.t) 5, 10, 20, 36, 65 conjugacy classes and 5, 10, 20, 36, 65 irreducible representations resp...
متن کاملA SOLOMON DESCENT THEORY FOR THE WREATH PRODUCTS G Sn
We propose an analogue of Solomon’s descent theory for the case of a wreath product G Sn, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht’s theory for the representations of wreath products, Okada’s extension to wreath products of the Robinson-Schensted correspondence, and Poirier’s quasisymmetric functions. We insist on the...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005